Power Domains Supporting Recursion and Failure
نویسنده
چکیده
Following the program of Moggi, the semantics of a simple non-deterministic functional language with recursion and failure is described by a monad. We show that this monad cannot be any of the known power domain constructions, because they do not handle non-termination properly. Instead, a novel construction is proposed and investigated. It embodies both non-determinism (choice and failure) and possible non-termination caused by recursion.
منابع مشابه
Reliability Based Optimal Preventive Maintenance Policy for High Voltage Circuit Breakers in Power Plants
Electric power industry have always try to provide reliable electricity to customers and at the same time decrease system costs. High Voltage circuit-breakers are an essential part of the power network. This study has developed a maintenance and replacement scheduling model for high voltage circuit- breakers that minimize maintenance costs while maintaining the acceptable reliability. This mo...
متن کاملFrequency Estimation of Unbalanced Three-Phase Power System using a New LMS Algorithm
This paper presents a simple and easy implementable Least Mean Square (LMS) type approach for frequency estimation of three phase power system in an unbalanced condition. The proposed LMS type algorithm is based on a second order recursion for the complex voltage derived from Clarke's transformation which is proved in the paper. The proposed algorithm is real adaptive filter with real parameter...
متن کاملBCS The Weakest Precondition
An extension of Dijkstra's guarded command language is studied, including unbounded demonic choice and a backtrack operator. We consider three orderings on this language: a reenement ordering deened by Back, a new deadlock ordering, and an approximation ordering of Nelson. The deadlock ordering is in between the two other orderings. All operators are monotonic in the Nelson ordering, but backtr...
متن کاملThe Weakest Precondition Calculus : Recursion
An extension of Dijkstra's guarded command language is studied, including unbounded demonic choice and a backtrack operator. We consider three orderings on this language: a reenement ordering deened by Back, a new deadlock ordering, and an approximation ordering of Nelson. The deadlock ordering is in between the two other orderings. All operators are monotonic in Nelson's ordering, but backtrac...
متن کاملA fully abstract denotational semantics for the calculus of higher-order communicating systems
In this paper we study the Calculus of Higher Order Communicating Systems (CHOCS) (Thomsen, Proc. of POPL’89, ACM, 1989, pp. 143–154; Inform. Comput. 116(1) (1995) 38–57) in a denotational setting. We present a construction of a denotational semantics for CHOCS which resides in a domain constructed using the standard constructions of separated sum, Cartesian product, the Plotkin power domain co...
متن کامل